On Verbosity Levels In Cognitive Problem Solvers

نویسندگان

  • Petr Jirku
  • Tomás Havránek
چکیده

The aim o f t h e paper i s t o d i s c u s s s e v e r a l i s s u e s t h a t u s u a l l y o c c u r when c o m p u t a t i o n a l l i n g u i s t i c s comes i n t o i n t e r a c t i o n s w i t h so r a p i d l y g rowing s~eas o f a r t i f i c i a l i n t e l l i g ence as i t can be s e e n e . g . i n d e s i g n i n g e x p e r t and c o n s u l t i n g sys tems or i n t h e a r e a o f au tomated programming o f knowledgeb a s e d problem s o l v i n g s y s t e m s . We w i l l men t ion h e r e problems o f communica t ing knowledge be tween machine and r e s e a r c h e r ( a u s e r o f a sys tem) which i s not an e x p e r t i n programming t e c h h i q u e v S i n c e n a t u r a l l a n ~ a ~ e i s a " n a t u r a l " form f o r e x p r e s s t n g knowledge (and most e x t r a m a t h e m a t i c a l knowledge a c t u a l l y e x i s t s i n t h i s form) i t cou ld be seemed t h a t n a t u r a l l anguage would be a l s o t he b e s t suppor t f o r communicat ing knowledge t h r o u g h a c o g n i t i v e p r o c e s s pe r fo rmed on a compute r . I s I t r e a l l y so? We want t o b r i n g arguments f o r a r a t h e r o p p o s i t e c l a i m by p o i n t e d ou~ s e v e r a l f o r m a t s f o r e x p r e s s i n g and communt o a t i n ~ s c i e n t i f i c knowledge which d i f f e r s from u s u a l n a t u r a l language oneso

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

برنامه‌ریزی درسی در دانشگاه به کمک مدل‌سازی دو مرحله‌ای برنامه‌ریزی ریاضی

 In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...

متن کامل

Lagrangian Relaxation Method for the Step fixed-charge Transportation Problem

In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...

متن کامل

Cognitive Ability Influences Reproductive Life History Variation in the Wild

Cognition has been studied intensively for several decades, but the evolutionary processes that shape individual variation in cognitive traits remain elusive [1-3]. For instance, the strength of selection on a cognitive trait has never been estimated in a natural population, and the possibility that positive links with life history variation [1-5] are mitigated by costs [6] or confounded by eco...

متن کامل

Cognitive Style, Awareness, and Learners’ Intake and Production of Grammatical Structures

This study investigated how awareness affected learners’ intake and production in relation to their cognitive styles. It is assumed that learners’ cognitive styles may affect their ability to notice particular features in the input and, consequently, their intake and production. Adult learners of English were exposed to four English structures through four sets of problem-solving tasks, followe...

متن کامل

Cognitive Structures of Good and Poor Novice Problem Solvers in Physics

The way knowledge is organized in memory is generally expected to relate to the degree of success in problem solving. In the present study, we investigated whether good novice problem solvers have their knowledge arranged around problem types to a greater extent than poor problem solvers have. In the subject of physics (electricity and magnetism), 12 problem types were distinguished according t...

متن کامل

Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities

Refinements are model transformations that leave large parts of the source models unchanged. Therefore, if refinements are executed outplace, model elements need to be copied to the target model. Refinements written in imperative languages are increasingly verbose, unless suitable language facilities exist for creating these copies implicitly. Thus, for languages restricted to general-purpose f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982